Fast iterative solution of large sparse linear systems on geographically separated clusters
نویسندگان
چکیده
Parallel asynchronous iterative algorithms exhibit features that are extremely well-suited for Grid computing, such as lack of synchronization points. Unfortunately, they also suffer from slow convergence rates. In this paper we propose using asynchronous methods as a coarse-grained preconditioner in a flexible iterative method, where the preconditioner is allowed to change in each iteration step. A full implementation of the algorithm is presented using Grid middleware that allows for both synchronous and asynchronous communication. Advantages and disadvantages of the approach are discussed. Numerical experiments on heterogeneous computing hardware demonstrate the effectiveness of the proposed algorithm on Grid computers, with application to large 2D and 3D bubbly flow problems.
منابع مشابه
DELFT UNIVERSITY OF TECHNOLOGY REPORT 09-12 Fast Iterative Solution of Large Sparse Linear Systems on Geographically Separated Clusters
Parallel asynchronous iterative algorithms exhibit features that are extremely well–suited for Grid computing, such as lack of synchronisation points. Unfortunately, they also suffer from slow convergence rates. In this paper we propose using asynchronous methods as a coarse–grain preconditioner in a flexible iterative method, where the preconditioner is allowed to change in each iteration step...
متن کاملPreconditioned Generalized Minimal Residual Method for Solving Fractional Advection-Diffusion Equation
Introduction Fractional differential equations (FDEs) have attracted much attention and have been widely used in the fields of finance, physics, image processing, and biology, etc. It is not always possible to find an analytical solution for such equations. The approximate solution or numerical scheme may be a good approach, particularly, the schemes in numerical linear algebra for solving ...
متن کاملUnit commitment by a fast and new analytical non-iterative method using IPPD table and “λ-logic” algorithm
Many different methods have been presented to solve unit commitment (UC) problem in literature with different advantages and disadvantages. The need for multiple runs, huge computational burden and time, and poor convergence are some of the disadvantages, where are especially considerable in large scale systems. In this paper, a new analytical and non-iterative method is presented to solve UC p...
متن کاملA Fast Method for Sparse Component Analysis Based on Iterative Detection-Estimation
We introduce a new iterative algorithm for Sparse Component Analysis (SCA). The algorithm, which we call Iterative Detection-Estimation (IDE), is essentially a method to find sufficiently sparse solutions of underdetermined linear systems of equations. In the SCA context, this solves the source separation part of the problem. Each iteration of IDE consists of two steps. In the detection step, s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IJHPCA
دوره 25 شماره
صفحات -
تاریخ انتشار 2011